fast euclidean minimum span tree algorithm analysi applic william march parikshit ram alexand grai euclidean minimum span tree problem applic wide rang field effici algorithm develop solv present fast gener emst algorithm motiv cluster analysi astronom data larg scale astronom survei includ sloan digit sky survei larg simul earli univers millennium simul million point fill terabyt storag tradit emst method scale quadrat advanc method lack rigor runtim guarante present dual tree algorithm effici comput emst adapt algorithm analysi prove tightest possibl optim runtim bound emst problem date demonstr scalabl method astronom data set 